package practice_3_2;
//递归求斐波那契数列的第 N 项
public class ReFib {
    public static void main(String[] args) {
        int n = 10;
        int ret = reFib(n);
        System.out.println(ret);
    }
    public static int reFib(int n){
        //递归结束条件
        if(n <= 2){
            return 1;
        }
        return reFib(n - 1) + reFib(n - 2);
    }
}
